kw.\*:("Process algebra")
Results 1 to 25 of 1012
Selection :
Axiomatising divergenceLOHREY, Markus; D'ARGENIO, Pedro R; HERMANNS, Holger et al.Information and computation (Print). 2005, Vol 203, Num 2, pp 115-144, issn 0890-5401, 30 p.Article
Algebra and coalgebra in computer science (Swansea, 3-6 September 2005)Fiadeiro, José Luiz; Harman, Neil; Roggenbach, Markus et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28620-9, XI, 455 p, isbn 3-540-28620-9Conference Proceedings
From T-coalgebras to filter structures and transition systemsGUMM, H. Peter.Lecture notes in computer science. 2005, pp 194-212, issn 0302-9743, isbn 3-540-28620-9, 19 p.Conference Paper
Algebra ∩ coalgebra = presheavesADAMEK, J.Lecture notes in computer science. 2005, pp 67-82, issn 0302-9743, isbn 3-540-28620-9, 16 p.Conference Paper
Adequacy for algebraic effects with statePLOTKIN, Onrdnn.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28620-9, p. 51Conference Paper
Thread algebra for poly-threadingBERGSTRA, J. A; MIDDELBURG, C. A.Formal aspects of computing. 2011, Vol 23, Num 4, pp 567-583, issn 0934-5043, 17 p.Article
The free process algebra generated by δ, ∈ and τRODENBURG, Piet H; WILLEM KLOP, Jan; KOYMANS, Karst et al.Theoretical computer science. 2011, Vol 412, Num 28, pp 3370-3377, issn 0304-3975, 8 p.Article
Unguardedness mostly means many solutionsBAETEN, Jos C. M; LUTTIK, Bas.Theoretical computer science. 2011, Vol 412, Num 28, pp 3090-3100, issn 0304-3975, 11 p.Article
On the axiomatizability of priority IIACETO, Luca; TAOLUE CHEN; INGOLFSDOTTIR, Anna et al.Theoretical computer science. 2011, Vol 412, Num 28, pp 3035-3044, issn 0304-3975, 10 p.Article
Decidability of strong bisimilarity for timed BPPLASOTA, Slawomir.Lecture notes in computer science. 2002, pp 562-578, issn 0302-9743, isbn 3-540-44043-7, 17 p.Conference Paper
Open questions (transcript of discussion)RYAN, Peter.Lecture notes in computer science. 2001, pp 49-53, issn 0302-9743, isbn 3-540-42566-7Conference Paper
On performance congruences for process algebrasCORRADINI, F.Information and computation (Print). 1998, Vol 145, Num 2, pp 191-230, issn 0890-5401Article
Proving properties of dynamic process networksDAM, M.Information and computation (Print). 1998, Vol 140, Num 2, pp 95-114, issn 0890-5401Article
Bounded stacks, bags and queuesBAETEN, J. C. M; BERGSTRA, J. A.Lecture notes in computer science. 1997, pp 104-118, issn 0302-9743, isbn 3-540-63141-0Conference Paper
Algebra of timed framesBERGSTRA, J. A; FOKKINK, W. J; MIDDELBURG, C. A et al.International journal of computer mathematics. 1996, Vol 61, Num 3-4, pp 227-255, issn 0020-7160Article
A finite basis for failure semanticsFOKKINK, Wan; NAIN, Sumit.Lecture notes in computer science. 2005, pp 755-765, issn 0302-9743, isbn 3-540-27580-0, 11 p.Conference Paper
On the axiomatizability of ready traces, ready simulation, and failure tracesBLOM, Stefan; FOKKINK, Wan; NAIN, Sumit et al.Lecture notes in computer science. 2003, pp 109-118, issn 0302-9743, isbn 3-540-40493-7, 10 p.Conference Paper
Allegories as a basis for algorithmicsBIRD, R. S.Lecture notes in computer science. 1997, pp 34-46, issn 0302-9743, isbn 3-540-63455-XConference Paper
Final sequences and final coalgebras for measurable spacesVIGLIZZO, Ignacio D.Lecture notes in computer science. 2005, pp 395-407, issn 0302-9743, isbn 3-540-28620-9, 13 p.Conference Paper
A non-SOS operational semantics for a process algebraFRACZAK, W; ZAREMBA, M. B.Information processing letters. 1998, Vol 68, Num 1, pp 47-54, issn 0020-0190Article
Generalised coinductionBARTELS, F.Report - Software engineering. 2000, Num 43, pp 1-45, issn 1386-369XArticle
Analyses statiques d'un calcul d'Acteurs par typage = Static analysis by type inference for an Actor calculusColaço, Jean-Louis; Sallé, Patrick.1997, 150 p.Thesis
An algebra-based method to associate rewards with EMPA termsBERNARDO, M.Lecture notes in computer science. 1997, pp 358-368, issn 0302-9743, isbn 3-540-63165-8Conference Paper
Model checking PA-processesMAYR, R.Lecture notes in computer science. 1997, pp 332-346, issn 0302-9743, isbn 3-540-63141-0Conference Paper
CONCUR '97 : concurrency theory (Warsaw, July 1-4, 1997)Mazurkiewicz, Antoni; Winkowski, Jósef.Lecture notes in computer science. 1997, issn 0302-9743, isbn 3-540-63141-0, VIII, 420 p, isbn 3-540-63141-0Conference Proceedings